A complementary tool to enhance the effectiveness of existing methods for heterogeneous fixed fleet vehicle routing problem
نویسندگان
چکیده
منابع مشابه
A Mixed Integer Programming Formulation for the Heterogeneous Fixed Fleet Open Vehicle Routing Problem
The heterogeneous fixed fleet open vehicle routing problem (HFFOVRP) is one of the most significant extension problems of the open vehicle routing problem (OVRP). The HFFOVRP is the problem of designing collection routes to a number of predefined nodes by a fixed fleet number of vehicles with various capacities and related costs. In this problem, the vehicle doesn’t return to the depot after se...
متن کاملA Model for Heterogeneous Fixed Fleet Vehicle Routing Problem
Transportation is one of the important infrastructures constituting the base and requisite for different levels of people’s access and movement to various locations. Transportation systems are one of the indices of the development of a region. Optimizing these systems contributes to improving performance and reducing costs of offering services to users. Hence, methods should be adopted with whi...
متن کاملa mixed integer programming formulation for the heterogeneous fixed fleet open vehicle routing problem
the heterogeneous fixed fleet open vehicle routing problem (hffovrp) is one of the most significant extension problems of the open vehicle routing problem (ovrp). the hffovrp is the problem of designing collection routes to a number of predefined nodes by a fixed fleet number of vehicles with various capacities and related costs. in this problem, the vehicle doesn’t return to the depot after se...
متن کاملA hybrid algorithm for the Heterogeneous Fleet Vehicle Routing Problem
This paper deals with the Heterogeneous Fleet Vehicle Routing Problem (HFVRP). The HFVRP generalizes the classical Capacitated Vehicle Routing Problem by considering the existence of different vehicle types, with distinct capacities and costs. The objective is to determine the best fleet composition as well as the set of routes that minimize the total costs. The proposed hybrid algorithm is com...
متن کاملA tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem
In the heterogeneous fixed fleet vehicle routing problem there are different types of vehicles and a given number of vehicles of each type. The resolution of this problem consists of assigning the customers to the existing vehicles and, in relation to each vehicle, defining the order of visiting each customer for the delivery or collection of goods. The objective is to minimize the total costs,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematical Modelling
سال: 2013
ISSN: 0307-904X
DOI: 10.1016/j.apm.2012.09.027